Uniform coverings of 2-paths with 5-paths in K2n

Uniform coverings of 2-paths by 4-paths

We construct a uniform covering of 2-paths by 4-paths in Kn for all n 2:: 5, i.e., we construct a set S of 4-paths in Kn having the property that each 2-path in Kn lies in exactly one 4-path in S for all 11, 2:: 5.

Uniform coverings of 2-paths with 6-cycles in the complete graph

The Principles of Conservation-based Organization of Historic Paths Through Benchmarking Method on Organization Experience of Iran and Other Countries (Case Study: The Organization of a Historic Roadway and Pathway in Isfahan under Status Assessment)

Paths are the most important urban spaces and account for the city and its historic district’s main structure. In the past, the geometry of historic cities revolved around old bazar rows and passages. However, with the advent of motorized vehicles and subsequent chess roads in historical texture, organic geometry and hierarchy of paths net, integrity and structure of historic district were disr...

Weighted Optimal Path in Graph with Multiple Indexes

This paper represents a technique for finding optimal paths with multiple indexes in a graph. Up to the present time, all optimal paths have been determined upon one index, say, distance for which an evaluation method exists. In this paper firstly we define multiple indexes for each edge in such a way that anyone can treat the factor for assigning an optimal path. Here, we use Data Envelopment ...

An Algorithm to Obtain Possibly Critical Paths in Imprecise Project Networks

  We consider criticality in project networks having imprecise activity duration times. It is well known that finding all possibly critical paths of an imprecise project network is an NP-hard problem. Here, based on a method for finding critical paths of crisp networks by using only the forward recursion of critical path method, for the first time an algorithm is proposed which can find all pos...